An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder
نویسندگان
چکیده
A new achievability scheme for the compound channel with discrete memoryless (DM) state noncausally available at the encoder is established. Achievability is proved using superposition coding, Marton coding, joint typicality encoding, and indirect decoding. The scheme is shown to achieve strictly higher rate than the straightforward extension of the Gelfand-Pinsker coding scheme for a single DMC with DM state, and is optimal for some classes of channels.
منابع مشابه
Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملOn The Secrecy of the Cognitive Interference Channel with Channel State
In this paper the secrecy problem in the cognitive state-dependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. Hence, the cognitive encoder uses this side information t...
متن کاملOn Coding with Rate-Limited Side Information
We consider an i.i.d. state-dependent channel with partial (rate limited) channel state information (CSI) at the transmitter (CSIT) and full CSI at the receiver (CSIR). The CSIT comprises a non-causal rate limited part, which is communicated by a third party (a genie) over a way-side channel, and may also include outputs of a deterministic scalar quantizer of the state. A single letter expressi...
متن کاملDirty-Paper Coding for the Multi-Access Channel with Conferencing
We derive the capacity region of the two-user dirtypaper Gaussian multi-access channel (MAC) with conferencing encoders. In this MAC, prior to each transmission block, the transmitters can hold a conference in which they can communicate with each other over error-free bit-pipes of given capacities. The received signal suffers not only from additive Gaussian noise but also from additive interfer...
متن کاملOn State Dependent Broadcast Channels with Cooperation
In this paper, we investigate problems of communication over physically degraded, state-dependent broadcast channels (BCs) with cooperating decoders. Two different setups are considered and their capacity regions are characterized. First, we study a setting in which one decoder can use a finite capacity link to send the other decoder information regarding the messages or the channel states. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1004.3427 شماره
صفحات -
تاریخ انتشار 2010